Search results for "network [detector]"

showing 10 items of 496 documents

Order allocation in a multiple suppliers-manufacturers environment within a dynamic cluster

2015

This study faces the problem of how to evaluate order allocation strategies in a multiple suppliers-manufacturers environment within a dynamic industry cluster that is an environment in which suppliers adopt a policy based on their performance to select the clusters in which to operate. Therefore, the allocation strategy performed by the manufacturers is crucial to keep a long-term supply chain partnership with a specific industry cluster. We use simulation to evaluate order allocation strategies under different market conditions. We show how an allocation strategy that takes into account the whole supply chain’s perspective leads to a sustainable development of the clusters of suppliers.

Sustainable developmentMedia managementOrder allocationComputer scienceMechanical EngineeringSupply chainSettore ING-IND/35 - Ingegneria Economico-GestionaleIndustrial and Manufacturing EngineeringComputer Science ApplicationsNetwork enterprises Coordination Order allocation ClusterSimulationControl and Systems EngineeringGeneral partnershipCluster (physics)Business clusterSoftwareIndustrial organizationSimulationMarket conditions
researchProduct

Optimal Configuration for N-Dimensional Twin Torus Networks

2014

Torus topology is one of the most common topologies used in the current largest supercomputers. Although 3D torus is widely used, recently some supercomputers in the Top500 list have been built using networks with topologies of five or six dimensions. To obtain an nD torus, 2n ports per node are needed. These ports can be offered by a single or several cards per node. In the second case, there are multiple ways of assigning the dimension and direction of the card ports. In a previous work we proposed the 3D Twin (3DT) torus which uses two 4-port cards per node, and obtained the optimal port configuration. This paper extends and generalizes that work in order to obtain the optimal port confi…

TOP500ComputerSystemsOrganization_COMPUTERSYSTEMIMPLEMENTATIONComputer scienceDimension (graph theory)Node (circuits)Topology (electrical circuits)Algorithm designTorusParallel computingRouting (electronic design automation)Network topologyTopologyComputer Science::Operating Systems2014 IEEE 13th International Symposium on Network Computing and Applications
researchProduct

Exploiting programmable architectures for WiFi/ZigBee inter-technology cooperation

2014

The increasing complexity of wireless standards has shown that protocols cannot be designed once for all possible deployments, especially when unpredictable and mutating interference situations are present due to the coexistence of heterogeneous technologies. As such, flexibility and (re)programmability of wireless devices is crucial in the emerging scenarios of technology proliferation and unpredictable interference conditions. In this paper, we focus on the possibility to improve coexistence performance of WiFi and ZigBee networks by exploiting novel programmable architectures of wireless devices able to support run-time modifications of medium access operations. Differently from software…

Technology and EngineeringCognitive networksComputer Networks and CommunicationsComputer scienceDynamic MAC adaptationTime division multiple access02 engineering and technologyMAC protocolMAC protocols0202 electrical engineering electronic engineering information engineeringWirelessCross-technology interferenceINTERFERENCEProtocol prototypingSettore ING-INF/03 - Telecomunicazionibusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsCognitive networkComputer Science ApplicationsEmbedded systemSignal ProcessingInterference avoidanceIBCNWireless network control020201 artificial intelligence & image processingbusinessCognitive networkDecoupling (electronics)Communication channelComputer networkEURASIP Journal on Wireless Communications and Networking
researchProduct

Network Centralities and Node Ranking

2017

An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.

Theoretical computer scienceCentrality measureNetwork topologyShortest pathSettore INF/01 - InformaticaComputer scienceBiological networkComputationNode (networking)Network topologySubgraph extractionNode centralityRankingShortest path problemCentralityBiological networkNetwork analysisNode neighborhoodNode ranking
researchProduct

Problems and Techniques

2017

When biological networks are considered, the extraction of interesting knowledge often involves subgraphs isomorphism check that is known to be NP-complete. For this reason, many approaches try to simplify the problem under consideration by considering structures simpler than graphs, such as trees or paths. Furthermore, the number of existing approximate techniques is notably greater than the number of exact methods. In this chapter, we provide an overview of three important problems defined on biological networks: network alignment, network clustering, and motifs extraction from biological networks. For each of these problems, we also describe some of the most important techniques proposed…

Theoretical computer scienceCommunity searchComputer scienceGraph alignmentNetwork alignmentNetwork clusteringIsomorphismBiological network
researchProduct

Statistically validated networks in bipartite complex systems.

2011

Many complex systems present an intrinsic bipartite nature and are often described and modeled in terms of networks [1-5]. Examples include movies and actors [1, 2, 4], authors and scientific papers [6-9], email accounts and emails [10], plants and animals that pollinate them [11, 12]. Bipartite networks are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set. When one constructs a projected network with nodes from only one set, the system heterogeneity makes it very difficult to identify preferential links between the elements. Here we introduce an unsupervised method to statistically validate each link of the pr…

Theoretical computer scienceComputer sciencelcsh:MedicineNetwork theorySocial and Behavioral SciencesBioinformaticsQuantitative Biology - Quantitative MethodsSociologyProtein Interaction Mappinglcsh:ScienceQuantitative Methods (q-bio.QM)MultidisciplinarySystems BiologyApplied MathematicsPhysicsStatisticsComplex SystemsGenomicsLink (geometry)Social NetworksSpecialization (logic)Interdisciplinary PhysicsBipartite graphProbability distributionResearch ArticleNetwork analysisPhysics - Physics and SocietyComplex systemFOS: Physical sciencesPhysics and Society (physics.soc-ph)Type (model theory)BiologyModels BiologicalNetwork theory Statistical PhysicsStatistical MechanicsSet (abstract data type)Statistical MethodsBiologyStructure (mathematical logic)Statistical Physicslcsh:RComputational BiologyModels TheoreticalComparative GenomicsSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)FOS: Biological sciencesNetwork theorylcsh:QNull hypothesisMathematicsPLoS ONE
researchProduct

Optimal Resource Discovery Paths of Gnutella2

2008

This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …

Theoretical computer sciencebusiness.industryComputer scienceNetwork topologyComputer Science::Digital LibrariesSteiner tree problemTree (graph theory)symbols.namesakeRandom walker algorithmSearch algorithmBounded functionsymbolsResource allocationLocal search (optimization)Gnutella2business22nd International Conference on Advanced Information Networking and Applications (aina 2008)
researchProduct

A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices

2019

Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…

Topology constructionSIMPLE (military communications protocol)Computer scienceExecutable code exchangeResource-constrained devicecomputer.file_formatConstruct (python library)Network topologyDistributed processingSet (abstract data type)Computer Networks and CommunicationHardware and ArchitectureA priori and a posterioriGraph (abstract data type)Symbolic processingExecutableInternet of ThingAlgorithmcomputerSoftwareAbstraction (linguistics)2019 International Conference on Computing, Networking and Communications (ICNC)
researchProduct

Inter-organizational networks and innovation in small, knowledge-intensive firms: A literature review

2013

Published version of article from the journal: International Journal of Innovation Management In this study, we address the effect of innovation strategy and an innovative working climate on financial performance in the Norwegian wood industry. Innovation strategy embodies four dimensions: the degrees to which innovation in the form of products, processes, and business systems are embedded in the management values and priorities as well as the degree of expenditure in R&D. An innovative working climate is exemplified by team cohesion, supervisory encouragement, resources, autonomy, challenge, and openness to innovation. Previous studies have indicated a lack of research in traditional manuf…

Transaction costNetwork diversitywood industryFinancial performanceStrategy and Managementinnovative working climateNetwork densityCooperation alliances network diversity network density innovativeness SMEs knowledge-intensive firms resource dependency institutional theory transaction cost theoryfinancial performanceInter organizationalManagement of Technology and InnovationManufacturing firmsmanufacturing firmsResource dependencyBusinessInnovation strategyBusiness and International ManagementMarketingInstitutional theoryIndustrial organizationVDP::Social science: 200::Economics: 210::Business: 213
researchProduct

Children’s Play and Art Practices with Agentic Objects

2018

Material objects, ranging from used pieces of gum to superhero capes, are an essential part of children’s play and art practices. However, such items are rarely analyzed as a part of children’s social interaction. Onto-epistemological, scientific, and bio-technological developments of the twentieth and twenty-first centuries have enhanced the interest in physical objects within many academic disciplines, and led some to consider if objects, too, can have social agency. In this article, I use Bruno Latour’s actor-network theory (ANT) to analyze three kinds of objects in the context of children’s play and art practices: (1) physical objects, (2) digital objects, and (3) transformative and ima…

Transformative learningAestheticsActor–network theoryAgency (sociology)PosthumanismContext (language use)SociologyDisciplineVisual arts educationSocial relation
researchProduct